Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
301	EUROGRAPHICS ’M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19, (2000), Number 3 Context-based Space Filling Curves Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-07-23 15:49:26 Mathematics Graph theory Computational complexity theory Fractal curves Television technology NP-complete problems Spanning tree Computer graphics Hilbert curve Space-filling curve Curve Peano curve
302	Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland Add to Reading List Source URL: www.ru.is Language: English - Date: 2016-01-22 09:24:33 Computational complexity theory NP-complete problems Combinatorial optimization Theoretical computer science Maximum cut Approximation algorithm International Colloquium on Automata Languages and Programming Algorithmica Halldrsson International Symposium on Algorithms and Computation European Symposium on Algorithms Graph coloring
303	Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch Add to Reading List Source URL: fc15.ifca.ai Language: English - Date: 2015-01-11 00:32:58 Cryptography Computational complexity theory Distance-bounding protocol Public-key cryptography Complexity classes Proof of knowledge IP Challengeresponse authentication NP Digital signature Security parameter Negligible function
304	Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-06-29 18:20:41 Computational complexity theory Theory of computation Complexity classes Mathematical optimization Structural complexity theory Models of computation P versus NP problem NP Reduction Time complexity Oracle machine Low
305	Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Work of Daniel A. Spielman Gil Kalai Dan Spielman has made groundbreaking contributions in theoretical computer Add to Reading List Source URL: www.icm2010.in Language: English - Date: 2012-02-02 09:07:19 Mathematics Computational complexity theory Computer science Analysis of algorithms Linear programming Operations research Mathematical optimization Smoothed analysis KleeMinty cube Simplex algorithm Daniel Spielman Algorithm
306	CSL Technical Report SRI-CSL-06-01 • May 23, 2006 Integrating Simplex with DPLL(T ) Bruno Dutertre and Leonardo de Moura This report is based upon work supported by the Defense Advanced Research Projects Add to Reading List Source URL: yices.csl.sri.com Language: English - Date: 2015-12-11 18:43:06 Theoretical computer science Computational complexity theory Mathematics Electronic design automation Formal methods Logic in computer science NP-complete problems Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Simplex algorithm
307	Learning and Explora/on in Automated Theorem Proving Moa Johansson Chalmers University of Technology Add to Reading List Source URL: www.ai4fm.org Language: English - Date: 2015-09-02 07:29:35 Logic Philosophy Abstraction Automated theorem proving Proof theory Computational complexity theory Proof assistants Theorem Mathematical proof Type theory Algorithm Proof
308	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
309	On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh Add to Reading List Source URL: www.complexity.ethz.ch Language: English - Date: 2012-03-28 07:53:42 Theoretical computer science Computational complexity theory Mathematics Automated theorem proving Logic in computer science Rules of inference Resolution Proof complexity Conflict-Driven Clause Learning Boolean algebra Exponential time hypothesis PP

UPDATE